Simulation of the Nested Relational Algebra by the at Relational Algebra, with an Application to the Complexity of Evaluating Powerset Algebra Expressions
نویسنده
چکیده
Paredaens and Van Gucht proved that the at relational algebra has the same expressive power as the nested relational algebra, as far as queries over at relations and with at results are concerned. We provide a new, very direct proof of this fact using a simulation technique. Our technique is also applied to partially answer a question posed by Suciu and Paredaens regarding the complexity of evaluating powerset algebra expressions. Speciically, we show that when only unary at relations are into play, any powerset algebra expression is either equivalent to a nested algebra expression, or its evaluation will produce intermediate results of exponential size.
منابع مشابه
Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
Paredaens and Van Gucht proved that the at relational algebra has the same expressive power as the nested relational algebra as far as queries over at relations and with at results are concerned We provide a new very direct proof of this fact using a simulation technique Our technique is also applied to partially answer a question posed by Suciu and Paredaens regarding the complexity of evaluat...
متن کاملSolving Equations in the Relational Algebra
Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases, equivalent to the well-known powerset algebra. We study sparse equations, which are equations with at most polynomially many solutions. We look at their complexity...
متن کاملThe Powerset Algebra as a Natural Tool to Handle Nested Database Relations
The nested relational algebra is often inadequate as a tool to handle nested relations, since several important queries, such as transitive closure, cannot expressed by it. On the other hand, the powerset algebra does allow the expression of transitive closure, but in a too expensive way. Therefore, we consider various other extensions to the nested algebra, such as least tixpoint and programmi...
متن کاملEquivalence of the Relational Algebra a N D Calculus for Nested Relations
Abstrac t -The relational model is extended to include nested structures. This extension is formalised using the distinction between a tuple scheme and a relation scheme. The algebra and calculus languages are defined for this model. It is shown that the restricted powerset is a derived operation in the algebra and the full powerset is expressible by a safe forraula in the calculus. Since the f...
متن کاملPOWERSET OPERATOR FOUNDATIONS FOR CATALG FUZZY SET THEORIES
The paper sets forth in detail categorically-algebraic or catalg foundations for the operations of taking the image and preimage of (fuzzy) sets called forward and backward powerset operators. Motivated by an open question of S. E. Rodabaugh, we construct a monad on the category of sets, the algebras of which generate the fixed-basis forward powerset operator of L. A. Zadeh. On the next step, w...
متن کامل